A Note on Using T-joins to Approximate Solutions for Cahier Du 329 a Note on Using T-joins to Approximate Solutions for Min Graphic K-path Tsp
نویسندگان
چکیده
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
منابع مشابه
A Note on Using T-joins to Approximate Solutions for min Graphic k-Path TSP
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
متن کاملLaboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Décembre 2012 A note on Using T - joins to Approximate Solutions for CAHIER DU 32 9
We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .
متن کاملSolving Volterra Integral Equations of the Second Kind with Convolution Kernel
In this paper, we present an approximate method to solve the solution of the second kind Volterra integral equations. This method is based on a previous scheme, applied by Maleknejad et al., [K. Maleknejad and Aghazadeh, Numerical solution of Volterra integral equations of the second kind with convolution kernel by using Taylor-series expansion method, Appl. Math. Comput. (2005)] to gain...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملA note on critical point and blow-up rates for singular and degenerate parabolic equations
In this paper, we consider singular and degenerate parabolic equations$$u_t =(x^alpha u_x)_x +u^m (x_0,t)v^{n} (x_0,t),quadv_t =(x^beta v_x)_x +u^q (x_0,t)v^{p} (x_0,t),$$ in $(0,a)times (0,T)$, subject to nullDirichlet boundary conditions, where $m,n, p,qge 0$, $alpha, betain [0,2)$ and $x_0in (0,a)$. The optimal classification of non-simultaneous and simultaneous blow-up solutions is determin...
متن کامل